A Comparative Study of Cooperative Algorithms for Wireless Ad Hoc Networks

In Ad-Hoc Networks (AHN), nodes can take on the role of a source, destination or relay. Relays are needed when source nodes wish to communicate with destination nodes that are far away. However, in acting as relays, nodes expend a significant amount of energy transmitting data across the network. Energy is a precious commodity for an AHN and the aim of nodes is to maximize their throughput and survive for the longest period possible. Thus, nodes would not be willing to act as relays all the time. As a result, efficient cooperative algorithms are needed in AHNs to determine when a node should act as a relay, thus ensuring the survivability and performance of nodes. However, there are issues that need to be considered before existing cooperative algorithms may be implemented in an actual AHN. This paper focuses on the research, modification, implementation, verification and analysis of the Generous Tit for Tat (GTFT) and Nuglet cooperative routing algorithms